A superlinearly convergent predictor-corrector method
نویسنده
چکیده
An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has O( √ nL)iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.
منابع مشابه
A Superlinearly Convergent O( P Nl)-iteration Algorithm for Linear Programming
In this note we consider a large step modiication of the Mizuno-Todd-Ye O(p nL) predictor-corrector interior-point algorithm for linear programming. We demonstrate that the modiied algorithm maintains its O(p nL)-iteration complexity, while exhibiting superlinear convergence for general problems and quadratic convergence for non-degenerate problems. To our knowledge, this is the rst constructio...
متن کاملA superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity
We correct an error in Algorithm 2 from [1].
متن کاملCorrector-predictor methods for sufficient linear complementarity problems
We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method does not depend on the handicap κ of the problem. The method has O((1+ κ)√nL)-iteration complexity, the same as Miao’s method, but our error est...
متن کاملCorrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
A higher order corrector-predictor interior-point method is proposed for solving sufficient linear complementarity problems. The algorithm produces a sequence of iterates in the N− ∞ neighborhood of the central path. The algorithm does not depend on the handicap κ of the problem. It has O((1 + κ) √ nL) iteration complexity and is superlinearly convergent even for degenerate problems.
متن کاملInterior Point Methods for Sufficient Lcp in a Wide Neighborhood of the Central Path with Optimal Iteration Complexity
Three interior point methods are proposed for sufficient horizontal linear complementarity problems (HLCP): a large update path following algorithm, a first order corrector-predictor method, and a second order corrector-predictor method. All algorithms produce sequences of iterates in the wide neighborhood of the central path introduced by Ai and Zhang. The algorithms do not depend on the handi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006